Numerical Semigroups and Codes
نویسنده
چکیده
Anumerical semigroup is a subset ofN containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of algebraic geometry codes, Weierstrass semigroups are crucial for defining bounds on the minimum distance as well as for defining improvements on the dimension of codes. We present these applications and some theoretical problems related to classification, characterization and counting of numerical semigroups.
منابع مشابه
On numerical semigroups and the redundancy of improved codes correcting generic errors
We introduce a new sequence τ associated to a numerical semigroup similar to the ν sequence used to define the order bound on the minimum distance and to describe the Feng–Rao improved codes. The new sequence allows a nice description of the optimal one-point codes correcting generic errors and to compare them with standard codes and with the Feng–Rao improved codes. The relation between the τ ...
متن کاملOn the second Feng-Rao distance of Algebraic Geometry codes related to Arf semigroups
We describe the second (generalized) Feng-Rao distance for elements in an Arf numerical semigroup that are greater than or equal to the conductor of the semigroup. This provides a lower bound for the second Hamming weight for one point AG codes. In particular, we can obtain the second Feng-Rao distance for the codes defined by asymptotically good towers of function fields whose Weierstrass semi...
متن کاملNumerical semigroups with maximal embedding dimension
Even though the study and relevance of maximal embedding dimension numerical semigroups arises in a natural way among the other numerical semigroups, they have become specially renowned due to the existing applications to commutative algebra via their associated semigroup ring (see for instance [1, 5, 15, 16, 99, 100]). They are a source of examples of commutative rings with some maximal proper...
متن کاملOn Semigroups Generated by Two Consecutive Integers and Hermitian Codes
Analysis of the Berlekamp-Massey-Sakata algorithm for decoding onepoint codes leads to two methods for improving code rate. One method, due to Feng and Rao, removes parity checks that may be recovered by their majority voting algorithm. The second method is to design the code to correct only those error vectors of a given weight that are also geometrically generic. In this work, formulae are gi...
متن کاملNumerical semigroups from open intervals
Consider an interval I ⊆ Q . Set S(I) = {m ∈ N : ∃ n ∈ N , mn ∈ I}. This turns out to be a numerical semigroup, and has been the subject of considerable recent investigation (see Chapter 4 of [2] for an introduction). Special cases include modular numerical semigroups (see [4]) where I = [mn , m n−1 ] (m,n ∈ N ), proportionally modular numerical semigroups (see [3]) where I = [mn , m n−s ] (m,n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.09765 شماره
صفحات -
تاریخ انتشار 2017